Isomorphisms of Function Modules, and Generalized Approximation in Modulus

نویسنده

  • DAVID BLECHER
چکیده

For a function algebra A we investigate relations between the following three topics: isomorphisms of singly generated A-modules, Morita equivalence bimodules, and ‘real harmonic functions’ with respect to A. We also consider certain groups which are naturally associated with a uniform algebra A. We illustrate the notions considered with several examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homotopy approximation of modules

Deleanu, Frei, and Hilton have developed the notion of generalized Adams completion in a categorical context. In this paper, we have obtained the Postnikov-like approximation of a module, with the help of a suitable set of morphisms.

متن کامل

Isomorphisms in unital $C^*$-algebras

It is shown that every  almost linear bijection $h : Arightarrow B$ of a unital $C^*$-algebra $A$ onto a unital$C^*$-algebra $B$ is a $C^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries  $u in A$, all $y in A$, and all $nin mathbb Z$, andthat almost linear continuous bijection $h : A rightarrow B$ of aunital $C^*$-algebra $A$ of real rank zero onto a unital$C^*$-algebra...

متن کامل

Some results of 2-periodic functions by Fourier sums in the space Lp(2)

In this paper, using the Steklov function, we introduce the generalized continuity modulus and denethe class of functions Wr;kp;' in the space Lp. For this class, we prove an analog of the estimates in [1]in the space Lp.

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Generalized local operators between function modules

Let X be a compact Hausdorff space, E be a normed space, A(X,E)  be a regular Banach function algebra on X , and A(X,E) be a subspace of C(X,E) . In this paper, first we introduce the notion of localness of an additive map S:A(X,E) → C(X,E) with respect to  additive maps T1,...,Tn: A(X) → C(X) and then we characterize the general form of such maps for a certain class of subspaces A(X,E) of C(...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999